Faithful Simulation of Randomized BFT Protocols on Block DAGs

Byzantine Fault-Tolerant (BFT) protocols that are based on Directed Acyclic Graphs (DAGs) are attractive due to their many advantages in asynchronous blockchain systems. These DAG-based protocols can be viewed as a simulation of some BFT protocol on a DAG. Many DAG-based BFT protocols rely on randomization, since they are used for agreement and ordering of transactions, which cannot be achieved deterministically in asynchronous systems. Randomization is achieved either through local sources of randomness, or by employing shared objects that provide a common source of randomness, e.g., common coins. A DAG simulation of a randomized protocol should be faithful, in the sense that it precisely preserves the properties of the original BFT protocol, and in particular, their probability distributions. We argue that faithfulness is ensured by a forward simulation. We show how to faithfully simulate any BFT protocol that uses public coins and shared objects, like common coins

Succinct Interactive Oracle Proofs: Applications and Limitations

\textit{Interactive Oracle Proofs} (IOPs) are a new type of proof-system that combines key properties of interactive proofs and PCPs: IOPs enable a verifier to be convinced of the correctness of a statement by interacting with an untrusted prover while reading just a few bits of the messages sent by the prover. IOPs have become very prominent in the design of efficient proof-systems in recent years. In this work we study \textit{succinct IOPs}, which are IOPs in which the communication complexity is polynomial (or even linear) in the original witness. While there are strong impossibility results for the existence of succinct PCPs (i.e., PCPs whose length is polynomial in the witness), it is known that the rich class of NP relations that are decidable in small space have succinct IOPs. In this work we show both new applications, and limitations, for succinct IOPs: \begin{itemize} \item First, using one-way functions, we show how to compile IOPs into zero-knowledge \textit{proofs}, while nearly preserving the proof length. This complements a recent line of work, initiated by Ben~Sasson~\etal{}~(TCC, 2016B), who compile IOPs into super-succinct zero-knowledge \textit{arguments}. Applying the compiler to the state-of-the-art succinct IOPs yields zero-knowledge proofs for bounded-space NP relations, with communication that is nearly equal to the original witness length. This yields the shortest known zero-knowledge proofs from the minimal assumption of one-way functions. \item Second, we give a barrier for obtaining succinct IOPs for more general NP relations. In particular, we show that if a language has a succinct IOP, then it can be decided in \textit{space} that is proportionate only to the witness length, after a bounded-time probabilistic preprocessing. We use this result to show that under a simple and plausible (but to the best of our knowledge, new) complexity-theoretic conjecture, there is no succinct IOP for CSAT. \end{itemize

Faithful Simulation of Randomized BFT Protocols on Block DAGs

Byzantine Fault-Tolerant (BFT) protocols that are based on Directed Acyclic Graphs (DAGs) are attractive due to their many advantages in asynchronous blockchain systems. These DAG-based protocols can be viewed as a simulation of some BFT protocol on a DAG. Many DAG-based BFT protocols rely on randomization, since they are used for agreement and ordering of transactions, which cannot be achieved deterministically in asynchronous systems. Randomization is achieved either through local sources of randomness, or by employing shared objects that provide a common source of randomness, e.g., common coins. A DAG simulation of a randomized protocol should be faithful, in the sense that it precisely preserves the properties of the original BFT protocol, and in particular, their probability distributions. We argue that faithfulness is ensured by a forward simulation. We show how to faithfully simulate any BFT protocol that uses public coins and shared objects, like common coins

Treatment of Atrophic Acne Scars with Platelet Rich Plasma Gel and Micro-needling

Background: Following the advancements in the treatment of acne, post-acne scarring is still a widespread problem. Platelet-rich plasma (PRP) gel is one formulation with beneficial biological or medicinal qualities that aid in the management of post-acne scarring. Objective: It was the goal of this work to evaluate the utilization of treatment of post-acne scars with micro-needling and plasma gel. Patients and Methods: Patients with post-acne scars were recruited from the university hospital's dermatology and venereology outpatient clinic. Our study was based on 23 patients (8 males= 34.8%, 15 females= 68.2%) having 3 skin types (II, III, IV); skin type III patients representing 56.2% of total patients, most of these patients have scars for less than 10 years. Dermapen has been done to the face then the PRP gel has been applied combined with microneedling to the post-acne scars. We performed four sessions of the previous treatment with two weeks intervals then one month’s follow-up. Results: The baron, as well as Goodman scale improvement significantly post-treated with Platelet Rich Plasma Gel Combined with micro-needling, where 69.6% of cases become grade1 post-treatment, drop grade 3 to be (8.7%) post-treatment compared to (47.8%) pre-treatment the difference statistically significant p=0.022. Furthermore, all grade4 fade out post-treatment p=0.008. Conclusion: Dermapen combined with plasma gel is a promising effective therapeutic modality for atrophic acne scars

Prognostic significance of plasma osteopontin level in breast cancer patients

Many studies have demonstrated that osteopontin (OPN) contributes functionally to aggressive behaviour in many tumours including breast cancer

Bardoxolone methyl in type 2 diabetes and stage 4 chronic kidney disease

BACKGROUND: Although inhibitors of the renin-angiotensin-aldosterone system can slow the progression of diabetic kidney disease, the residual risk is high. Whether nuclear 1 factor (erythroid-derived 2)-related factor 2 activators further reduce this risk is unknown. METHODS: We randomly assigned 2185 patients with type 2 diabetes mellitus and stage 4 chronic kidney disease (estimated glomerular filtration rate [GFR], 15 to <30 ml per minute per 1.73 m2 of body-surface area) to bardoxolone methyl, at a daily dose of 20 mg, or placebo. The primary composite outcome was end-stage renal disease (ESRD) or death from cardiovascular causes. RESULTS: The sponsor and the steering committee terminated the trial on the recommendation of the independent data and safety monitoring committee; the median follow-up was 9 months. A total of 69 of 1088 patients (6%) randomly assigned to bardoxolone methyl and 69 of 1097 (6%) randomly assigned to placebo had a primary composite outcome (hazard ratio in the bardoxolone methyl group vs. the placebo group, 0.98; 95% confidence interval [CI], 0.70 to 1.37; P=0.92). In the bardoxolone methyl group, ESRD developed in 43 patients, and 27 patients died from cardiovascular causes; in the placebo group, ESRD developed in 51 patients, and 19 patients died from cardiovascular causes. A total of 96 patients in the bardoxolone methyl group were hospitalized for heart failure or died from heart failure, as compared with 55 in the placebo group (hazard ratio, 1.83; 95% CI, 1.32 to 2.55; P<0.001). Estimated GFR, blood pressure, and the urinary albumin-to-creatinine ratio increased significantly and body weight decreased significantly in the bardoxolone methyl group, as compared with the placebo group. CONCLUSIONS: Among patients with type 2 diabetes mellitus and stage 4 chronic kidney disease, bardoxolone methyl did not reduce the risk of ESRD or death from cardiovascular causes. A higher rate of cardiovascular events with bardoxolone methyl than with placebo prompted termination of the trial. Copyright © 2013 Massachusetts Medical Society